Presentation of push-down automation as oriented multigraphs
نویسندگان
چکیده
منابع مشابه
Subsumption{oriented Push{down Automata ?
This paper presents Subsumption{oriented Push{Down Auto-mata (SPDA), a very general stack formalism used to describe forest (\AND{ OR" tree) traversals. These automata may be used for parsing or the interpretation of logic programs. SPDA allow a Dynamic Programming execution which breaks computations into combinable, sharable and storable sub{computations. They provide computation sharing and o...
متن کاملA redefinition of Embedded Push-Down Automata
A new definition of Embedded Push-Down Automata is provided. We prove this new definition preserves the equivalence with tree adjoining languages and we provide a tabulation framework to execute any automaton in polynomial time with respect to the length of the input string.
متن کاملPush-Down Automata with Gap-Order Constraints
We consider push-down automata with data (PDAD) that operate on variables ranging over the set of natural numbers. The conditions on variables are defined via gap-order constraint. Gap-order constraints allow to compare variables for equality, or to check that the gap between the values of two variables exceeds a given natural number. The messages inside the stack are equipped with values that ...
متن کاملAutonomous Push-down Automaton Built on DNA
In the paper written by Cavaliere, Janoska, Yogev, Piran, Keinan, Seeman [4] the authors propose a theoretical model (i.e. not tested in laboratory) of implementation of the push-down automaton built on DNA. The idea was inspired by two papers: the first one by Rothemund [7] who proposed a simulation of the Turing machine the basic theoretical model of computation and the second one by Benenson...
متن کاملMulti-Push-Down Languages and Grammars
A new class of languages, called multi-push-down (mpd), that generalize the classical context-free (cf, or Chomsky type 2) ones is introduced. These languages preserve some important properties of cf languages: a generalization of the Chomsky-Schh utzenberger homomorphic characterization theorem, the Parikh theorem and a \pumping lemma" are proved. Multi-push-down languages are an AFL. Their re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science and Education of the Bauman MSTU
سال: 2012
ISSN: 1994-0408
DOI: 10.7463/0912.0460973